Estimating self-similarity through complex variations
نویسندگان
چکیده
منابع مشابه
Estimating Heavy-Tail Exponents Through Max Self-Similarity
Abstract: In this paper, a novel approach to the problem of estimating the heavy–tail exponent α > 0 of a distribution is proposed. It is based on the fact that block–maxima of size m of the independent and identically distributed data scale at a rate of m. This scaling rate can be captured well by the max–spectrum plot of the data that leads to regression based estimators. Consistency and asym...
متن کاملSelf - Similarity Through High - Variability :
| A number of recent empirical studies of traf-c measurements from a variety of working packet networks have convincingly demonstrated that actual network traac is self-similar or long-range dependent in nature (i.e., bursty over a wide range of time scales) { in sharp contrast to commonly made traac modeling assumptions. In this paper, we provide a plausible physical explanation for the occurr...
متن کاملComment on “self-similarity of complex networks”
Many complex networks exhibit a scale-free, power-law distribution of vertex degrees. This common feature is a consequence of two generic mechanisms relating to the formation of real networks: (i) Networks tend to expand over time through the addition of new vertices, and (ii) New vertices attach preferentially to those that are already well connected. We show that for many natural or man-made ...
متن کاملA review of fractality and self-similarity in complex networks
We review recent findings of self-similarity in complex networks. Using the box-covering technique, it was shown that many networks present a fractal behavior, which is seemingly in contrast to their small-world property. Moreover, even non-fractal networks have been shown to present a self-similar picture under renormalization of the length scale. These results have an important effect in our ...
متن کاملSelf-similarity of complex networks and hidden metric spaces
We demonstrate that the self-similarity of some scale-free networks with respect to a simple degree-thresholding renormalization scheme finds a natural interpretation in the assumption that network nodes exist in hidden metric spaces. Clustering, i.e., cycles of length three, plays a crucial role in this framework as a topological reflection of the triangle inequality in the hidden geometry. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Statistics
سال: 2012
ISSN: 1935-7524
DOI: 10.1214/12-ejs717